Quick Subset Construction

A finite automaton can be either deterministic (DFA) or nondeterministic (NFA). An automaton-based task is in general more efficient when performed with a DFA rather than an NFA. For any NFA there equivalent that generated by the classical Subset Construction algorithm. When, however, large may transformed into series of actions operating directly on NFA, unnecessarily expensive computation, as (possibly large) portion regenerated is, waste processing. This why conservative algorithm for determinization proposed, called Quick Construction, which progressively transforms instead generating from scratch, thereby avoiding unnecessary proven, both formally and empirically, to inasmuch it generates exactly same DFA. Experimental results indicate that, smaller number repair compared size DFA, faster over Construction.